- average tree height
- средняя высота дерева
Англо-русский сельскохозяйственный словарь. 2013.
average tree height
Смотреть что такое "average tree height" в других словарях:
Tree — For other uses, see Tree (disambiguation). Trees on a mountain in northern Utah during early autumn … Wikipedia
Red-black tree — A red black tree is a type of self balancing binary search tree, a data structure used in computer science, typically used to implement associative arrays. The original structure was invented in 1972 by Rudolf Bayer who called them symmetric… … Wikipedia
Diameter at breast height — Diameter at breast height, or DBH, is a standard method of expressing the diameter of the trunk or bole of a standing tree. DBH is one of the most common dendrometric measurements. Tree trunks are measured at the height of an adult s breast,… … Wikipedia
Christmas tree production — Customers haul a harvested Christmas tree at a choose and cut Christmas tree farm in the U.S. state of Maryland. Christmas tree production occurs worldwide on Christmas tree farms, in artificial tree factories and from native stands of pine and… … Wikipedia
Fruit tree propagation — is usually carried out through asexual reproduction by grafting or budding the desired variety onto a suitable rootstock. Perennial plants can be propagated either by sexual or vegetative means. Sexual reproduction occurs when male pollen from… … Wikipedia
AVL tree — In computer science, an AVL tree is a self balancing binary search tree, and it is the first such data structure to be invented. [Robert Sedgewick, Algorithms , Addison Wesley, 1983, ISBN 0 201 06672 6, page 199, chapter 15: Balanced Trees.] In… … Wikipedia
Binary search tree — In computer science, a binary search tree (BST) is a binary tree data structurewhich has the following properties: *each node (item in the tree) has a value; *a total order (linear order) is defined on these values; *the left subtree of a node… … Wikipedia
Scapegoat tree — In computer science, a scapegoat tree is a self balancing binary search tree, invented by Igal Galperin and Ronald L. Rivest. It provides worst case O(log n ) lookup time, and O(log n ) amortized insertion and deletion time.Unlike other self… … Wikipedia
Self-balancing binary search tree — In computer science, a self balancing binary search tree or height balanced binary search tree is a binary search tree that attempts to keep its height , or the number of levels of nodes beneath the root, as small as possible at all times,… … Wikipedia
List of Happy Tree Friends characters — This is a list of fictional characters from Happy Tree Friends. There are 22 main characters, and some other supporting characters. To celebrate the 10th anniversary of the series in 2010, the creators of Happy Tree Friends announced that there… … Wikipedia
Site tree (forestry) — Site tree refers to a type of tree used in forestry to classify the quality of growing conditions at a particular forest location. A site tree is a single tree in a stand (group of growing trees) that gives a good representation of the average… … Wikipedia
